On Q-Resolution and CDCL QBF Solving
نویسنده
چکیده
Q-resolution and its variations provide the underlying proof systems for the DPLL-based QBF solvers. While (long-distance) Q-resolution models a conflict driven clause learning (CDCL) QBF solver, it is not known whether the inverse is also true. This paper provides a negative answer to this question. This contrasts with SAT solving, where CDCL solvers have been shown to simulate resolution.
منابع مشابه
Dependency Schemes in QBF Calculi: Semantics and Soundness
We study the parametrization of QBF resolution calculi by dependency schemes. One of the main problems in this area is to understand for which dependency schemes the resulting calculi are sound. Towards this end we propose a semantic framework for variable independence based on ‘exhibition’ by QBF models, and use it to define a property of dependency schemes called full exhibition. We prove tha...
متن کاملFeasible Interpolation for QBF Resolution Calculi
In sharp contrast to classical proof complexity we are currently short of lower bound techniques for QBF proof systems. In this paper we establish the feasible interpolation technique for all resolution-based QBF systems, whether modelling CDCL or expansion-based solving. This both provides the first general lower bound method for QBF proof systems as well as largely extends the scope of classi...
متن کاملDepQBF 6.0: A Search-Based QBF Solver Beyond Traditional QCDCL
We present the latest version 6.0 of the quantified Boolean formula (QBF) solver DepQBF, which is based on QCDCL. QCDCL is an extension of the conflict-driven clause learning (CDCL) paradigm implemented in state of the art propositional satisfiability (SAT) solvers. The Q-resolution calculus (QRES) is a QBF proof system which underlies QCDCL. QCDCL solvers can produce QRES proofs of QBFs in pre...
متن کاملLong-Distance Resolution: Proof Generation and Strategy Extraction in Search-Based QBF Solving
Strategies (and certificates) for quantified Boolean formulas (QBFs) are of high practical relevance as they facilitate the verification of results returned by QBF solvers and the generation of solutions to problems formulated as QBFs. State of the art approaches to obtain strategies require traversing a Q-resolution proof of a QBF, which for many real-life instances is too large to handle. In ...
متن کاملExpansion-based QBF solving versus Q-resolution
This article introduces and studies a proof system ∀Exp+Res that enables us to refute quantified Boolean formulas (QBFs). The system ∀Exp+Res operates in two stages: it expands all universal variables through conjunctions and refutes the result by propositional resolution. This approach contrasts with the Q-resolution calculus, which enables refuting QBFs by rules similar to propositional resol...
متن کامل